Computing elliptic curve discrete logarithms with the negation map
نویسندگان
چکیده
منابع مشابه
Computing elliptic curve discrete logarithms with the negation map
It is clear that the negation map can be used to speed up the computation of elliptic curve discrete logarithms with the Pollard rho method. However, the random walks defined on elliptic curve points equivalence class {±P} used by Pollard rho will always get trapped in fruitless cycles. We propose an efficient alternative approach to resolve fruitless cycles. Besides the theoretical analysis, w...
متن کاملQuantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
We give precise quantum resource estimates for Shor’s algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition, implemented within the framework of the quantum computing software tool suite LIQUi|〉. We determine circuit implementations for reversible modular a...
متن کاملFaster elliptic-curve discrete logarithms on FPGAs
This paper accelerates FPGA computations of discrete logarithms on elliptic curves over binary fields. As a toy example, this paper successfully attacks the SECG standard curve sect113r2, a binary elliptic curve that was not removed from the SECG standard until 2010 and was not disabled in OpenSSL until June 2015. This is a new size record for completed ECDL computations, using a prime order ve...
متن کاملComputing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
The negation map can be used to speed up the computation of elliptic curve discrete logarithms using either the baby-step giant-step algorithm (BSGS) or Pollard rho. Montgomery’s simultaneous modular inversion can also be used to speed up Pollard rho when running many walks in parallel. We generalize these ideas and exploit the fact that for any two elliptic curve points X and Y , we can effici...
متن کاملElliptic Curve Discrete Logarithms and the Index Calculus
The discrete logarithm problem forms the basis of numerous cryptographic systems. The most eeective attack on the discrete logarithm problem in the multiplicative group of a nite eld is via the index calculus, but no such method is known for elliptic curve discrete logarithms. Indeed, Miller 23] has given a brief heuristic argument as to why no such method can exist. IN this note we give a deta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2012
ISSN: 0020-0255
DOI: 10.1016/j.ins.2012.01.044